Performance of binary nonsymmetric and binary erasure memoryless channels with Viterbi decoding using importance sampling
نویسندگان
چکیده
منابع مشابه
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode ...
متن کاملDensity Evolution for Asymmetric Memoryless Channels: The Perfect Projection Condition and the Typicality of the Linear LDPC Code Ensemble
Density evolution is one of the most powerful analytical tools for low-density parity-check (LDPC) codes and graph codes with message passing decoding algorithms. With channel symmetry as one of its fundamental assumptions, density evolution has been widely and successfully applied to different channels, including binary erasure channels, binary symmetric channels, binary additive white Gaussia...
متن کاملSpatially Coupled LDPC Ensembles on Burst Erasure Channels
Spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we focus on the performance of these ensembles over binary erasure channels affected additionally by bursts. We assume that the burst can erase either a complete spatial...
متن کاملLife Above Threshold: From List Decoding to Area Theorem and MSE
We consider communication over memoryless channels using low-density parity-check code ensembles above the iterative (belief propagation) threshold. What is the computational complexity of decoding (i.e., of reconstructing all the typical input codewords for a given channel output) in this regime? We define an algorithm accomplishing this task and analyze its typical performance. The behavior o...
متن کاملAchievable Rates for Stability of LTI Systems over Noisy Forward and Feedback Channels
This paper studies sufficient conditions on information rate and control for stability of remote LTI systems connected over noisy forward and reverse (feedback) channels. In particular we consider discrete memoryless (DMC), Gaussian and erasure channels. We study zero-delay, time-invariant coding and decoding policies with memoryless control. For Gaussian channels we provide an achievable regio...
متن کامل